Submodule construction as equation solving in CCS
نویسندگان
چکیده
منابع مشابه
Submodule Construction as Equation Solving in CCS
A method for solving CCS equations of type (AIX)\L ~ B, where X is unknown, is presented. The method is useful in a top-down design methodology: if a system (B) and some of its submodules (.4) axe specified, solving such an equation amounts to constructing the missing submodules. The method works by successively transforming equations into simpler equations, in parallel with generation of a sol...
متن کاملSubmodule Construction Using Derivatives
Top-down design methodology is one of the widely used approaches to the design of complex concurrent systems. In this approach, the speciication of a system is decomposed into a set of submodules whose concurrent behavior is equivalent to that of the system speciication. The following problem is of particular importance when using this methodology: given the speciication of a system and some of...
متن کاملSubmodule Construction and Supervisory Control: A Generalization
We consider the following problem: For a system consisting of two submodules, the behavior of one submodule is known as well as the desired behavior S of the global system. What should be the behavior of the second submodule such that the behavior of the composition of the two submodules conforms to S ?-This problem has also been called "equation solving", and in the context of supervisory cont...
متن کاملSubmodule Construction for Extended State Machine Models
In this paper, we consider the problem of extending existing submodule construction techniques that have been developed for finite state models into more expressive and compact behavioral models that handle data through parameterized interactions, state variables and simple guards. We provide a behavioral model based on extended Input-Output Automata and describe an algorithm that provides the ...
متن کاملSearching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verification. This approach is of special interest as it offers theoretical advantages in the analysis of systems that communicate values, have infinite state space or show parameterised behaviour. The use of UFI, however, has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90128-x